Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data
نویسندگان
چکیده
We show how to provide privacy-preserving (zero-knowledge) answers to order queries on network data that is organized in lists, trees, and partially-ordered sets of bounded dimension. Our methods are efficient and dynamic, in that they allow for updates in the ordering information while also providing for quick and verifiable answers to queries that reveal no information besides the answers to the queries themselves.
منابع مشابه
Poster: Zero-Knowledge Authenticated Order Queries and Applications
Releasing verifiable partial information while maintaining privacy of the rest of the data is a requirement in many practical scenarios. In particular, maintaining an ordered list of elements in a trustworthy and privacy-preserving manner has a number of applications in management of network information and health care data. In this poster, we discuss our efficient, fully dynamic, secure and pr...
متن کاملSESOS: A Verifiable Searchable Outsourcing Scheme for Ordered Structured Data in Cloud Computing
While cloud computing is growing at a remarkable speed, privacy issues are far from being solved. One way to diminish privacy concerns is to store data on the cloud in encrypted form. However, encryption often hinders useful computation cloud services. A theoretical approach is to employ the so-called fully homomorphic encryption, yet the overhead is so high that it is not considered a viable s...
متن کاملVerifiable Member and Order Queries on a List in Zero-Knowledge
We introduce a formal model for order queries on lists in zero knowledge in the traditional authenticated data structure model. We call this model Privacy-Preserving Authenticated List (PPAL). In this model, the queries are performed on the list stored in the (untrusted) cloud where data integrity and privacy have to be maintained. To realize an efficient authenticated data structure, we first ...
متن کاملVerifiable Order Queries and Order Statistics on a List in Zero-Knowledge∗
Given a list L with n elements, an order query on L asks whether a given element x ∈ L precedes or follows another element y ∈ L . More generally, given a set of m elements from L , an order query asks for the set ordered according to the positions of the elements in L . We introduce two formal models for answering order queries on a list in a verifiable manner and in zero-knowledge. We also pr...
متن کاملKey Technologies and Applications of Secure Multiparty Computation
With the advent of the information age, the network security is particularly important. The secure multiparty computation is a very important branch of cryptography. It is a hotspot in the field of information security. It expanded the scope of the traditional distributed computing and information security, provided a new computing model for the network collaborative computing. First we introdu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015